The Application of K–Shortest Path Algorithm in Multicast Routing

Abstract. There have been many heuristic algorithms finding multicast trees proposed over the past few years. The necessity for finding a better and more suitable algorithm is still a current and important challenge. The article presents a new multicast routing algorithm for finding a multicast tree in packet networks. The objective of the K-Shortest Path Multicast Algorithm (KSPMA) is to minimize the cost of paths between the source and each destination node using a generalized Dijkstra’s algorithm that would comply with maximum delay bound along each path. A wide range of simulation research carried out by the authors for many network topologies and parameters has confirmed the effectiveness of the proposed algorithm.